An Arabic Slot Grammar Parser

نویسندگان

  • Michael McCord
  • Violetta Cavalli-Sforza
چکیده

We describe a Slot Grammar (SG) parser for Arabic, ASG, and new features of SG designed to accommodate Arabic as well as the European languages for which SGs have been built. We focus on the integration of BAMA with ASG, and on a new, expressive SG grammar formalism, SGF, and illustrate how SGF is used to advantage in ASG.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Syntactic Filter on Pronomial Anaphora for Slot Grammar

We propose a syntactic falter for identifying non-coreferential pronoun-NP pairs within a sentence. The filter applies to the output of a Slot Grammar parser and is formulated m terms of the head-argument structures which the parser generates. It liandles control and unbounded dependency constructions without empty categories or binding chains, by virtue of the uniticational nature of the parse...

متن کامل

Studying impressive parameters on the performance of Persian probabilistic context free grammar parser

In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...

متن کامل

A top-down chart parser for analyzing arabic sentences

Parsing of Arabic sentences is a necessary mechanism for many natural language processing applications such as machine translation; question answering, knowledge extraction and information retrieval. In this study, we present a top-down chart parser for parsing simple Arabic sentences, including nominal and verbal sentences within specific domain Arabic grammar. We used the Context Free Grammar...

متن کامل

Anaphora Resolution in Slot Grammar

We present three algorithms for resolving anaphora in Slot Grammar: (1) an algorithm for interpreting elliptical VPs in antecedent-contained deletion structures, subdeletion constructions, and intersentential cases; (2) a syntactic filter on pronominal coreference; and (3) an algorithm for identifying the binder of an anaphor (reflexive pronoun or the reciprocal phrase "each other"). These algo...

متن کامل

A Parser Generation with the LKB for the Arabic Relatives

The relative phenomenon is considered as a rather delicate linguistic phenomenon and not explored enough by researchers, especially for the Arabic language. In an attempt to deal with this phenomenon, we propose in this paper a study about different forms of relative clauses. This study will be used for the building of a parser that can process relative sentences. This parser is constructed usi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007